Extragradient method for finding a saddle point in a multicriteria problem with dynamics
نویسندگان
چکیده
منابع مشابه
SADDLE POINT VARIATIONAL METHOD FOR DIRAC CONFINEMENT
A saddle point variational (SPV ) method was applied to the Dirac equation as an example of a fully relativistic equation with both negative and positive energy solutions. The effect of the negative energy states was mitigated by maximizing the energy with respect to a relevant parameter while at the same time minimizing it with respect to another parameter in the wave function. The Cornell pot...
متن کاملBasin constrained κ-dimer method for saddle point finding.
Within the harmonic approximation to transition state theory, the rate of escape from a reactant is calculated from local information at saddle points on the boundary of the state. The dimer minimum-mode following method can be used to find such saddle points. But as we show, dimer searches that are initiated from a reactant state of interest can converge to saddles that are not on the boundary...
متن کاملGeneralized iterative methods for solving double saddle point problem
In this paper, we develop some stationary iterative schemes in block forms for solving double saddle point problem. To this end, we first generalize the Jacobi iterative method and study its convergence under certain condition. Moreover, using a relaxation parameter, the weighted version of the Jacobi method together with its convergence analysis are considered. Furthermore, we extend a method...
متن کاملBiased gradient squared descent saddle point finding method.
The harmonic approximation to transition state theory simplifies the problem of calculating a chemical reaction rate to identifying relevant low energy saddle points in a chemical system. Here, we present a saddle point finding method which does not require knowledge of specific product states. In the method, the potential energy landscape is transformed into the square of the gradient, which c...
متن کاملA three-level BDDC algorithm for a saddle point problem
Abstract BDDCalgorithms have previously been extended to the saddle point problems arising frommixed formulations of elliptic and incompressible Stokes problems. In these two-level BDDC algorithms, all iterates are required to be in a benign space, a subspace in which the preconditioned operators are positive definite. This requirement can lead to large coarse problems, which have to be generat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Trudy Instituta Matematiki i Mekhaniki UrO RAN
سال: 2016
ISSN: 0134-4889
DOI: 10.21538/0134-4889-2016-22-2-71-78